For-All Sparse Recovery in Near-Optimal Time
نویسندگان
چکیده
منابع مشابه
A For-all Sparse Recovery in Near-Optimal Time
An approximate sparse recovery system in `1 norm consists of parameters k, , N , an m-by-N measurement Φ, and a recovery algorithm, R. Given a vector, x, the system approximates x by x̂ = R(Φx), which must satisfy ‖x̂− x‖1 ≤ (1 + )‖x− xk‖1. We consider the “for all” model, in which a single matrix Φ, possibly “constructed” non-explicitly using the probabilistic method, is used for all signals x. ...
متن کاملSublinear time, measurement-optimal, sparse recovery for all
An approximate sparse recovery system in `1 norm makes a small number of measurements of a noisy vector with at most k large entries and recovers those heavy hitters approximately. Formally, it consists of parameters N, k, , anm-by-N measurement matrix, Φ, and a decoding algorithm,D. Given a vector, x, where xk denotes the optimal k-term approximation to x, the system approximates x by x̂ = D(Φx...
متن کامل8 D ec 2 01 0 Sublinear Time , Measurement - Optimal , Sparse Recovery For All
An approximate sparse recovery system in l1 norm makes a small number of measurements of a noisy vector with at most k large entries and recovers those heavy hitters approximately. Formally, it consists of parameters N, k, ǫ, an m-by-N measurement matrix, Φ, and a decoding algorithm, D. Given a vector, x, where xk denotes the optimal k-term approximation to x, the system approximates x by x̂ = D...
متن کاملListing all maximal cliques in sparse graphs in near-optimal time
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy. To achieve this result, we modify the classic Bron–Kerbosch algorithm and show that it runs in time O(dn3d/3). We also pr...
متن کاملCompressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3039872